Solving the Cubic Cell Formation Problem Using Simulated Annealing

نویسندگان

چکیده

The Cubic Cell Formation Problem (CCFP) in cellular manufacturing systems consists decomposing a production system into set of cells, and assigning workers to cells besides parts machines. major objective is obtain manageable cells. Manageable mean with minimum value inter-cell moves heterogeneity within In this paper, solution methodology based on modified simulated annealing heuristic proposed neighbourhood search procedure proposed. allows building multiple configurations by giving the decision-maker ability control some parameters. Experimental results show that algorithm gives promising performance for all problem instances found literature.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

متن کامل

Solving the Assignment Problem using Genetic Algorithm and Simulated Annealing

The paper attempts to solve the generalized “Assignment problem” through genetic algorithm and simulated annealing. The generalized assignment problem is basically the “N menN jobs” problem where a single job can be assigned to only one person in such a way that the overall cost of assignment is minimized. While solving this problem through genetic algorithm (GA), a unique encoding scheme is us...

متن کامل

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

Simulated Annealing Approach for Solving Bilevel Programming Problem

Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of information retrieval research

سال: 2022

ISSN: ['2155-6377', '2155-6385']

DOI: https://doi.org/10.4018/ijirr.290827